Towards Optimizing Hierarchical Data Revisions

نویسندگان

  • Burkhard Schaffrin
  • Jackson Cothren
چکیده

The revision of existing data must always be considered when new data are collected which have known relations with the old data, thereby taking into account that the two datasheets in question may belong to one and the same, or to two different hierarchical levels. In the first case, optimal data fusion would amount to a joint adjustment and, as a result, to modifications of the existing data which may then be checked for their significance. In the second case, the situation turns out to be somewhat trickier since, after the integration, the old dataset with a higher position in the hierarchy should still be unaffected, including the corresponding dispersion matrix. Here we shall explore the optimal procedure for the second case and present a unifying algorithm which would allow us to go ahead with the revisions until (only in the last step) we have to decide about the hierarchical behaviour. Although some of the more theoretical questions must be left unanswered at this point, we do include an example in which two photogrammetric networks of substantially different scales are to be integrated.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimizing a Hierarchical Hub Covering Problem with Mandatory Dispersion of Central Hubs

The hierarchical hub location problem is encountered three-level network that is applied in production-distribution system, education system, emergency medical services, telecommunication network, etc. This paper addresses the hierarchical hub covering problem with single assignment accounting for mandatory dispersion of central hubs restriction as a special case. This formulation with incorpor...

متن کامل

Optimizing Diamond Structured Automobile Supply Chain Network Towards a Robust Business Continuity Management

This paper presents an optimized diamond structured automobile supply chain network towards a robust Business Continuity Management model. The model is necessitated by the nature of the automobile supply chain. Companies in tier two are centralized and numerically limited and have to supply multiple tier one companies with goods and services. The challenge with this supply chain structure is th...

متن کامل

Characteristics of a Hierarchical Data Clustering Algorithm Based on Gravity Theory

Clustering algorithms that output a hierarchical dendrogram as return are classified as hierarchical clustering algorithms. The most desirable feature of the hierarchical clustering algorithm is that a hierarchical dendrogram is generated. This feature is very important for applications such as in biological, social, and behavior studies, due to the need to construct taxonomies. One general pro...

متن کامل

A Corpus of Sentence-level Revisions in Academic Writing: A Step towards Understanding Statement Strength in Communication

The strength with which a statement is made can have a significant impact on the audience. For example, international relations can be strained by how the media in one country describes an event in another; and papers can be rejected because they overstate or understate their findings. It is thus important to understand the effects of statement strength. A first step is to be able to distinguis...

متن کامل

Secondary Revisions After Facial Transplantation: Optimizing Functional and Aesthetic Outcomes.

INTRODUCTION: Facial transplantation (FT) has emerged as a viable option in treating devastating facial injuries. 1-3 The benefits of near normal restoration of multiple functional and aesthetic units in previously non-reconstructable defects have been reported in the literature and media. 1-2 However, as with autologous free tissue transfer, the need for secondary revisions in FT also exists. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003